NORA: Scalable OWL reasoner based on NoSQL databases and Apache Spark
نویسندگان
چکیده
Abstract Reasoning is the process of inferring new knowledge and identifying inconsistencies within ontologies. Traditional techniques often prove inadequate when reasoning over large Knowledge Bases containing millions or billions facts. This article introduces NORA, a persistent scalable OWL reasoner built on top Apache Spark, designed to address challenges extensive complex NORA exploits scalability NoSQL databases effectively apply inference rules Big Data ontologies with ABoxes. To facilitate reasoning, data, including class property hierarchies instances, are materialized in Cassandra database. Spark programs then evaluated iteratively, uncovering implicit from dataset leading enhanced performance more efficient large‐scale has undergone thorough evaluation different benchmarking varying sizes assess developed solution.
منابع مشابه
Owlgres: A Scalable OWL Reasoner
We present Owlgres, a DL-Lite reasoner implementation written for PostgreSQL, a mature open source database. Owlgres is an OWL reasoner that provides consistency checking and conjunctive query services, supports DL-LiteR as well as the OWL sameAs construct, and is not limited to PostgreSQL. We discuss the implementation with special focus on sameAs and the supported subset of the SPARQL languag...
متن کاملThe SCREECH OWL reasoner – Scalable approximate ABox reasoning with OWL∗
We present a preliminary version of the approximate OWL reasoning system SCREECH. It builds on the KAON2 system and performs OWL ABox reasoning in an approximate manner. It trades soundness of reasoning for efficiency, with resulting polynomial worst-case data complexity. It has been developed for use in time-critical applications where quick response time is more important than a full guarante...
متن کاملScalable SDE Filtering and Inference with Apache Spark
In this paper, we consider the problem of Bayesian filtering and inference for time series data modeled as noisy, discrete-time observations of a stochastic differential equation (SDE) with undetermined parameters. We develop a Metropolis algorithm to sample from the high-dimensional joint posterior density of all SDE parameters and state time series. Our approach relies on an innovative densit...
متن کاملEnhancing Rule-based OWL Reasoning on Spark
The rule-based OWL reasoning is to compute the deductive closure of an ontology by applying RDF/RDFS and OWL entailment rules. In previous work, we present an approach to enhancing the performance of the rule-based OWL reasoning on Spark based on a locally optimal executable strategy. However, some key optimizations that based on LUBM do not generalize to more diverse datasets. In this paper, w...
متن کاملPROSE: A Plugin-Based Paraconsistent OWL Reasoner
The study of paraconsistent reasoning with ontologies is especially important for the Semantic Web since knowledge is not always perfect within it. Quasi-classical semantics is proven to rationally draw more meaningful conclusions even from an inconsistent ontology with the stronger inference power of paraconsistent reasoning. In our previous work, we have conceived a quasi-classical framework ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software - Practice and Experience
سال: 2023
ISSN: ['0038-0644', '1097-024X']
DOI: https://doi.org/10.1002/spe.3258